منابع مشابه
ABCDepth: efficient algorithm for Tukey depth
We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given d-dimensional data set for any d ≥ 2, the algorithm is based on representation of level sets as intersections of balls in R, and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann. Stat. 28 (2000), 461–482)). The algorithm complexity is O(dn + n log n) where n is the data set size...
متن کاملTukey Depth-based Multivariate Trimmed Means
We investigate the asymptotic behavior of two types of Tukey depth-based multivariate trimmed means. Sufficient conditions for asymptotic normality of these location estimators are given. Two approaches to trimming are distinguished and central limit theorems are derived for each one. Asymptotic normality is proved using Hadamard differentiability of the location functionals. In the one-dimensi...
متن کاملThe Cooley - Tukey Fast Fourier Transform Algorithm ∗
The publication by Cooley and Tukey [5] in 1965 of an e cient algorithm for the calculation of the DFT was a major turning point in the development of digital signal processing. During the ve or so years that followed, various extensions and modi cations were made to the original algorithm [6]. By the early 1970's the practical programs were basically in the form used today. The standard develo...
متن کاملFunctional classification and the random Tukey depth. Practical issues
Depths are used to attempt to order the points of a multidimensional or infinite dimensional set from the “center of the set” to the “outer of it”. There are few definitions of depth which are valid in the functional case. One of them is the so-called random Tukey depth, which is based on some randomly chosen one-dimensional projections and thus varies (randomly) from computation to computation...
متن کاملAbsolute approximation of Tukey depth: Theory and experiments
A Monte Carlo approximation algorithm for the Tukey depth problem in high 5 dimensions is introduced. The algorithm is a generalization of an algorithm presented by 6 Rousseeuw and Struyf (1998). The performance of this algorithm is studied both analyti7 cally and experimentally. 8
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics
سال: 2016
ISSN: 0943-4062,1613-9658
DOI: 10.1007/s00180-016-0697-8